package com.lintcode.solution;

public class Solution_62 {
    public int search(int[] A, int target) {
        int result = - 1;
        for (int i = 0; i < A.length; i++) {
            if (A[ i ] == target) {
                return i;
            }
        }
        return result;
    }
}
